Attaining Potentially Good Reduction in Arithmetic Dynamics

نویسنده

  • ROBERT L. BENEDETTO
چکیده

Let K be a non-archimedean field, and let φ ∈ K(z) be a rational function of degree d ≥ 2. If φ has potentially good reduction, we give an upper bound, depending only on d, for the minimal degree of an extension L/K such that φ is conjugate over L to a map of good reduction. In particular, if d = 2 or d is less than the residue characteristic of K, the bound is d + 1. If K is discretely valued, we give examples to show that our bound is sharp. Fix the following notation throughout this paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-similar fractals and arithmetic dynamics

‎The concept of self-similarity on subsets of algebraic varieties‎ ‎is defined by considering algebraic endomorphisms of the variety‎ ‎as `similarity' maps‎. ‎Self-similar fractals are subsets of algebraic varieties‎ ‎which can be written as a finite and disjoint union of‎ ‎`similar' copies‎. ‎Fractals provide a framework in which‎, ‎one can‎ ‎unite some results and conjectures in Diophantine g...

متن کامل

A Criterion for Potentially Good Reduction in Non-archimedean Dynamics

Let K be a non-archimedean field, and let φ ∈ K(z) be a polynomial or rational function of degree at least 2. We present a necessary and sufficient condition, involving only the fixed points of φ and their preimages, that determines whether or not the dynamical system φ : P → P has potentially good

متن کامل

Variance analysis of control variate technique and applications in Asian option ‎pricing‎

This paper presents an analytical view of variance reduction by control variate technique for pricing arithmetic Asian options as a financial derivatives. In this paper, the effect of correlation between two random variables is shown. We propose an efficient method for choose suitable control in pricing arithmetic Asian options based on the control variates (CV). The numerical experiment shows ...

متن کامل

A Family of Recursive Least-squares Adaptive Algorithms Suitable for Fixed-point Implementation

The main feature of the least-squares adaptive algorithms is their high convergence rate. Unfortunately, they encounter numerical problems in finite precision implementation and especially in fixed-point arithmetic. The objective of this paper is twofold. First, an analysis of the finite precision effects of the recursive least-squares (RLS) algorithm is performed, outlining some specific probl...

متن کامل

Dynamic Modeling of Economic System in Iran

The long term goal attaining of economic system management requires the establishment of a dynamic framework to integrate multiple perspectives. This article considers the problem of economic development in macro level. As economic systems are complex adaptive systems composed of numerous numbers of components of dynamic and multidimensional nature, dynamics method is applied in this research. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014